Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
Identifieur interne : 006290 ( Main/Exploration ); précédent : 006289; suivant : 006291Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
Auteurs : Chuck Liang [États-Unis] ; Gopalan Nadathur [États-Unis] ; Xiaochu Qi [États-Unis]Source :
- Journal of Automated Reasoning [ 0168-7433 ] ; 2004-09-01.
English descriptors
Abstract
Abstract: Higher-order representations of objects such as programs, proofs, formulas, and types have become important to many symbolic computation tasks. Systems that support such representations usually depend on the implementation of an intensional view of the terms of some variant of the typed lambda calculus. New notations have been proposed for the lambda calculus that provide an excellent basis for realizing such implementations. There are, however, several choices in the actual deployment of these notations the practical consequences of which are not currently well understood. We attempt to develop such an understanding here by examining the impact on performance of different combinations of the features afforded by such notations. Among the facets examined are the treatment of bound variables, eagerness and laziness in substitution and reduction, the ability to merge different structure traversals into one, and the virtues of annotations on terms that indicate their dependence on variables bound by external abstractions. We complement qualitative assessments with experiments conducted by executing programs in a language that supports an intensional view of lambda terms while varying relevant aspects of the implementation of the language. Our study provides insights into the preferred approaches to representing and reducing lambda terms and also exposes characteristics of computations that have a somewhat unanticipated effect on performance.
Url:
DOI: 10.1007/s10817-004-6885-1
Affiliations:
Links toward previous steps (curation, corpus...)
- to stream Istex, to step Corpus: 003A02
- to stream Istex, to step Curation: 003958
- to stream Istex, to step Checkpoint: 001604
- to stream Main, to step Merge: 006515
- to stream Main, to step Curation: 006290
Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts</title><author><name sortKey="Liang, Chuck" sort="Liang, Chuck" uniqKey="Liang C" first="Chuck" last="Liang">Chuck Liang</name></author><author><name sortKey="Nadathur, Gopalan" sort="Nadathur, Gopalan" uniqKey="Nadathur G" first="Gopalan" last="Nadathur">Gopalan Nadathur</name></author><author><name sortKey="Qi, Xiaochu" sort="Qi, Xiaochu" uniqKey="Qi X" first="Xiaochu" last="Qi">Xiaochu Qi</name></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:F24F092B559343BC4354EF6B9673DEB2A21524F7</idno><date when="2005" year="2005">2005</date><idno type="doi">10.1007/s10817-004-6885-1</idno><idno type="url">https://api.istex.fr/ark:/67375/VQC-7GLV472T-3/fulltext.pdf</idno><idno type="wicri:Area/Istex/Corpus">003A02</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Corpus" wicri:corpus="ISTEX">003A02</idno><idno type="wicri:Area/Istex/Curation">003958</idno><idno type="wicri:Area/Istex/Checkpoint">001604</idno><idno type="wicri:explorRef" wicri:stream="Istex" wicri:step="Checkpoint">001604</idno><idno type="wicri:doubleKey">0168-7433:2005:Liang C:choices:in:representation</idno><idno type="wicri:Area/Main/Merge">006515</idno><idno type="wicri:Area/Main/Curation">006290</idno><idno type="wicri:Area/Main/Exploration">006290</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts</title><author><name sortKey="Liang, Chuck" sort="Liang, Chuck" uniqKey="Liang C" first="Chuck" last="Liang">Chuck Liang</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">État de New York</region></placeName><wicri:cityArea>Department of Computer Science, Hofstra University, 11550, Hempstead</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Nadathur, Gopalan" sort="Nadathur, Gopalan" uniqKey="Nadathur G" first="Gopalan" last="Nadathur">Gopalan Nadathur</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Minnesota</region></placeName><wicri:cityArea>Department of Computer Science and Engineering and Digital Technology Center, University of Minnesota, 4-192 EE/CS Building, 200 Union Street S.E., 55455, Minneapolis</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author><author><name sortKey="Qi, Xiaochu" sort="Qi, Xiaochu" uniqKey="Qi X" first="Xiaochu" last="Qi">Xiaochu Qi</name><affiliation wicri:level="2"><country xml:lang="fr">États-Unis</country><placeName><region type="state">Minnesota</region></placeName><wicri:cityArea>Department of Computer Science and Engineering, University of Minnesota, 4-192 EE/CS Building, 200 Union Street S.E., 55455, Minneapolis</wicri:cityArea></affiliation><affiliation wicri:level="1"><country wicri:rule="url">États-Unis</country></affiliation></author></analytic><monogr></monogr><series><title level="j">Journal of Automated Reasoning</title><title level="j" type="abbrev">J Autom Reasoning</title><idno type="ISSN">0168-7433</idno><idno type="eISSN">1573-0670</idno><imprint><publisher>Kluwer Academic Publishers</publisher><pubPlace>Dordrecht</pubPlace><date type="published" when="2004-09-01">2004-09-01</date><biblScope unit="volume">33</biblScope><biblScope unit="issue">2</biblScope><biblScope unit="page" from="89">89</biblScope><biblScope unit="page" to="132">132</biblScope></imprint><idno type="ISSN">0168-7433</idno></series></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0168-7433</idno></seriesStmt></fileDesc><profileDesc><textClass><keywords scheme="KwdEn" xml:lang="en"><term>explicit substitution</term><term>implementation</term><term>lambda calculus</term><term>lambda conversion</term></keywords></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: Higher-order representations of objects such as programs, proofs, formulas, and types have become important to many symbolic computation tasks. Systems that support such representations usually depend on the implementation of an intensional view of the terms of some variant of the typed lambda calculus. New notations have been proposed for the lambda calculus that provide an excellent basis for realizing such implementations. There are, however, several choices in the actual deployment of these notations the practical consequences of which are not currently well understood. We attempt to develop such an understanding here by examining the impact on performance of different combinations of the features afforded by such notations. Among the facets examined are the treatment of bound variables, eagerness and laziness in substitution and reduction, the ability to merge different structure traversals into one, and the virtues of annotations on terms that indicate their dependence on variables bound by external abstractions. We complement qualitative assessments with experiments conducted by executing programs in a language that supports an intensional view of lambda terms while varying relevant aspects of the implementation of the language. Our study provides insights into the preferred approaches to representing and reducing lambda terms and also exposes characteristics of computations that have a somewhat unanticipated effect on performance.</div></front></TEI><affiliations><list><country><li>États-Unis</li></country><region><li>Minnesota</li><li>État de New York</li></region></list><tree><country name="États-Unis"><region name="État de New York"><name sortKey="Liang, Chuck" sort="Liang, Chuck" uniqKey="Liang C" first="Chuck" last="Liang">Chuck Liang</name></region><name sortKey="Liang, Chuck" sort="Liang, Chuck" uniqKey="Liang C" first="Chuck" last="Liang">Chuck Liang</name><name sortKey="Nadathur, Gopalan" sort="Nadathur, Gopalan" uniqKey="Nadathur G" first="Gopalan" last="Nadathur">Gopalan Nadathur</name><name sortKey="Nadathur, Gopalan" sort="Nadathur, Gopalan" uniqKey="Nadathur G" first="Gopalan" last="Nadathur">Gopalan Nadathur</name><name sortKey="Qi, Xiaochu" sort="Qi, Xiaochu" uniqKey="Qi X" first="Xiaochu" last="Qi">Xiaochu Qi</name><name sortKey="Qi, Xiaochu" sort="Qi, Xiaochu" uniqKey="Qi X" first="Xiaochu" last="Qi">Xiaochu Qi</name></country></tree></affiliations></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/Lorraine/explor/InforLorV4/Data/Main/Exploration
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 006290 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Main/Exploration/biblio.hfd -nk 006290 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/Lorraine
|area= InforLorV4
|flux= Main
|étape= Exploration
|type= RBID
|clé= ISTEX:F24F092B559343BC4354EF6B9673DEB2A21524F7
|texte= Choices in Representation and Reduction Strategies for Lambda Terms in Intensional Contexts
}}
| This area was generated with Dilib version V0.6.33. |  |